Eventual Extensions of Finite Codes

نویسندگان

  • MIKE BOYLE
  • Kenneth R. Meyer
چکیده

Suppose S and T are shift equivalent mixing shifts of finite type, and / is a conjugacy from a subsystem of S to a subsystem of T. Then for any sufficiently large n, f extends to a conjugacy of Sn and Tn. A consequence of the proof is a fortified version of Wagoner's Stable FOG Theorem. Recall [Wi] that a nonnegative integral matrix A is the adjacency matrix of a directed graph whose arc set is the coordinate state space of a shift of finite type (SFT), which we denote (X^, 5,4). In this paper we prove the following theorem. Eventual Extension Theorem. Let (X,S) be a subshift contained in a mixing SFT (X^S^). If f be a continuous injective map f: X —► Xb such that f S = SßfThen the following are equivalent. (1) A and B are shift equivalent. (2) For any sufficiently large n, there exists a homeomorphism f: Xa —* Xb such that f = JonXand f(SA)n = (SB)nfCOROLLARY. Let (X,S) be a mixing SFT and suppose U is an automorphism of a subshift of (X,S). Then for all large n, U extends to an automorphism of (X,Sn). As an application of the ideas involved in the proof of the theorem (specificially of Lemma 1), we provide in the appendix a more direct proof of Wagoner's Stable FOG Theorem [Wa2]. This proof also yields technical improvements in the result which lead to a concrete presentation theorem for automorphisms of the shift which lie in the kernel of the dimension representation. We find the theorem and its corollary of interest for three reasons. The first is its relevance to a fundamental unsolved problem of symbolic dynamics, due essentially to R. F. Williams: when does an automorphism of a subsystem of a mixing SFT extend to an automorphism of the SFT? This question is basic to understanding the dynamics: one wants to know whether isomorphic subsystems, especially finite subsystems such as fixed points, can sit within the SFT in essentially different ways. Also, Williams has pointed out that this extension problem provides a test for his conjecture [Wi] that shift equivalence implies conjugacy: for example, it is possible that a transposition of fixed points may extend to an automorphism in one SFT but not in a shift equivalent SFT. The corollary provides some insight into this Received by the editors December 1, 1987. 1980 Mathematics Subject Classification (1985 Revision). Primary 54H20; Secondary 58F15, 28D20. This research was partially supported by the National Science Foundation under grant DMS8601619. ©1988 American Mathematical Society 0002-9939/88 $1.00 + $.25 per page

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entropy of infinite systems and transformations

The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...

متن کامل

Computing in degree 2k-extensions of finite fields of odd characteristic

We show how to perform basic operations (arithmetic, square roots, computing isomorphisms) over finite fields of the form F q2 in essentially linear time. Mathematics Subject Classification 2010. Primary 11Y16, 12Y05, Secondary 68W30.

متن کامل

On Skew Cyclic Codes over a Finite Ring

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

متن کامل

Weierstrass semigroups from Kummer extensions

The Weierstrass semigroups and pure gaps can be helpful in constructing codes with better parameters. In this paper, we investigate explicitly the minimal generating set of the Weierstrass semigroups associated with several totally ramified places over arbitrary Kummer extensions. Applying the techniques provided by Matthews in her previous work, we extend the results of specific Kummer extensi...

متن کامل

Efficiency of Anti-Hourglassing Approaches in Finite Element Method (TECHNICAL NOTE)

one of the simplest numerical integration method which provides a large saving in computational efforts, is the well known one-point Gauss quadrature which is widely used for 4 nodes quadrilateral elements. On the other hand, the biggest disadvantage to one-point integration is the need to control the zero energy modes, called hourglassing modes, which arise. The efficiency of four different an...

متن کامل

A Performance Evaluation Of Multimedia Kernels Using AltiVec Streaming SIMD Extensions

This paper aims to provide an understanding of performance of multimedia applications that use floating-point computations on recent general-purpose microprocessors using streaming SIMD ISA extensions. We used 8 benchmarks to study the impact of these extensions on general application performance and identify the eventual bottlenecks introduced.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010